subset sum problem造句
例句與造句
- For example, an early suggestion was to use schemes based on the subset sum problem.
- The Merkle-Hellman system is based on the subset sum problem ( a special case of the knapsack problem ).
- Under certain assumptions, finding a collision in ECOH may be also viewed as an instance of the subset sum problem.
- The 3-partition problem is similar to the partition problem, which in turn is related to the subset sum problem.
- The generalization of subset sum problem is called multiple subset-sum problem, in which multiple bins exist with the same capacity.
- It's difficult to find subset sum problem in a sentence. 用subset sum problem造句挺難的
- In computer science, the "'subset sum problem "'is an important problem in complexity theory and cryptography.
- Consider the subset sum problem, an example of a problem that is easy to verify, but whose answer may be difficult to compute.
- For instance, the subset sum problem is this : " Given a set of numbers, does any subset of them sum to N ? ".
- In string theory the number of false vacua is thought to be somewhere between 10 10 to 10 500 . being a version of the subset sum problem.
- The solution for subset sum also provides the solution for the original subset sum problem in the case where the numbers are small ( again, for nonnegative numbers ).
- In 2015, Koiliaris and Xu found the \ tilde { O } ( s \ sqrt N ) algorithm for the subset sum problem where s is the sum we need to find.
- An example of an "'NP "'- complete problem is the subset sum problem : given a finite set of integers, is there a non-empty subset that sums to zero?
- However, after this problem was proved to be "'NP "'- complete, proof by reduction provided a simpler way to show that many other problems are also "'NP "'- complete, including the subset sum problem discussed earlier.
- Finding the " minimal " sequence of multiplications ( the minimal-length addition chain for the exponent ) for " b " " n " is a difficult problem for which no efficient algorithms are currently known ( see Subset sum problem ), but many reasonably efficient heuristic algorithms are available.
- The article I linked is perhaps more hopeful : " The pseudo-polynomial time dynamic programming solution for the subset sum problem applies to the partition problem as well, and gives an exact answer in polynomial time when the size of the given integers is bounded . " Perhaps you could use a variant of that solution and execute it in reasonable time.